P Systems with Active Membranes Characterize PSPACE
نویسندگان
چکیده
P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve in polynomial time exactly the class of problems PSPACE. Consequently, these P systems are computationally equivalent (w.r.t. the polynomial time reduction) to standard parallel machine models as PRAM and the alternating Turing machine.
منابع مشابه
Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes
P systems are parallel molecular computing models based on processing multisets of objects in cell-like membrane structures. Recently, Petr Sosı́k has shown that a semi-uniform family of P systems with active membranes and 2-division is able to solve the PSPACE-complete problem QBF-SAT in linear time; he has also conjectured that the membrane dissolving rules of the (d) type may be omitted, but ...
متن کاملElementary Active Membranes Have the Power of Counting
P systems with active membranes [9] are known to solve computationally hard problems in polynomial time by trading space for time: an exponential number of membranes is created in polynomial time by using division rules, and then massive parallelism is exploited, e.g., to explore the whole solution space of an NP-complete problem in parallel. When we allow nonelementary division rules, i.e., ru...
متن کاملAn Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes
We show that a deterministic single-tape Turing machine, operating in polynomial space with respect to the input length, can be efficiently simulated (both in terms of time and space) by a semi-uniform family of P systems with active membranes and three polarizations, using only communication rules. Then, basing upon this simulation, we prove that a result similar to the space hierarchy theorem...
متن کاملMembrane computing and complexity theory: A characterization of PSPACE
A P system is a natural computing model inspired by information processing in cells and cellular membranes. We show that confluent P systems with active membranes solve in polynomial time exactly the class of problems PSPACE. Consequently, these P systems prove to be equivalent (up to a polynomial time reduction) to the alternating Turing machine or the PRAM computer. Similar results were achie...
متن کاملFirst Steps Towards Linking Membrane Depth and the Polynomial Hierarchy
Active membrane systems without charges are an extremely interesting group of models to study from the computational complexity point of view. Forbidding the use of a single rule type yields dramatic differences in computing power of these models. For example, it is known that systems with strong non-elementary division characterise PSPACE [1, 14], but when dissolution is forbidden these system...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006